Splay Tree
نویسنده
چکیده
Splay trees are self-adjusting binary search trees which were invented by Sleator and Tarjan [1]. This entry provides executable and verified functional splay trees. The amortized complexity of splay trees is analyzed in the AFP entry Amortized Complexity.
منابع مشابه
Multi-Splay Trees
In this thesis, we introduce a new binary search tree data structure called multi-splay tree and prove that multi-splay trees have most of the useful properties different binary search trees (BSTs) have. First, we demonstrate a close variant of the splay tree access lemma [ST85] for multi-splay trees, a lemma that implies multi-splay trees have the O(log n) runtime property, the static finger p...
متن کاملGraduate Algorithms
Problem 1. No. Couterexample (see Figure 1). If we start with the tree on the left and perform splay(2), then there is no sequence of splay operations to return to the starting tree. Note that we have enumerated all possible splay operations from each tree in the right side of the figure, since there are only 3 possible nodes to splay and one of them is the root (hence splaying it would result ...
متن کاملSkip-Splay: Toward Achieving the Unified Bound in the BST Model
We present skip-splay, the first binary search tree algorithm known to have a running time that nearly achieves the unified bound. Skip-splay trees require only O(m lg lg n + UB(σ)) time to execute a query sequence σ = σ1 . . . σm. The skip-splay algorithm is simple and similar to the splay algorithm.
متن کاملIn Pursuit of the Dynamic Optimality Conjecture
In 1985, Sleator and Tarjan introduced the splay tree, a self-adjusting binary search tree algorithm. Splay trees were conjectured to perform within a constant factor as any offline rotation-based search tree algorithm on every sufficiently long sequence—any binary search tree algorithm that has this property is said to be dynamically optimal. However, currently neither splay trees nor any othe...
متن کاملDynamic Optimality and Multi-Splay Trees1
The Dynamic Optimality Conjecture [ST85] states that splay trees are competitive (with a constant competitive factor) among the class of all binary search tree (BST) algorithms. Despite 20 years of research this conjecture is still unresolved. Recently Demaine et al. [DHIP04] suggested searching for alternative algorithms which have small, but non-constant competitive factors. They proposed tan...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Archive of Formal Proofs
دوره 2014 شماره
صفحات -
تاریخ انتشار 2014